Sparse Adversarial Perturbations for Videos
نویسندگان
چکیده
منابع مشابه
Sparse Adversarial Perturbations for Videos
Although adversarial samples of deep neural networks (DNNs) have been intensively studied on static images, their extensions in videos are never explored. Compared with images, attacking a video needs to consider not only spatial cues but also temporal cues. Moreover, to improve the imperceptibility as well as reduce the computation cost, perturbations should be added on as fewer frames as poss...
متن کاملOn Detecting Adversarial Perturbations
Machine learning and deep learning in particular has advanced tremendously on perceptual tasks in recent years. However, it remains vulnerable against adversarial perturbations of the input that have been crafted specifically to fool the system while being quasi-imperceptible to a human. In this work, we propose to augment deep neural networks with a small “detector” subnetwork which is trained...
متن کاملGenerative Adversarial Perturbations
In this paper, we propose novel generative models for creating adversarial examples, slightly perturbed images resembling natural images but maliciously crafted to fool pre-trained models. We present trainable deep neural networks for transforming images to adversarial perturbations. Our proposed models can produce image-agnostic and image-dependent perturbations for targeted and nontargeted at...
متن کاملSparse Models for Adversarial Learning
As the use of prediction methods becomes more widespread in applications the chances of adversarial manipulation becomes more likely. The canonical example is email and web spam where there is a constant tussle. We propose classification models which are robust against data manipulation by adversaries. For example, spammers are constantly manipulating data to breach spam filters by either rever...
متن کاملSparse Sampling for Adversarial Games
This paper introduces Monte Carlo *-Minimax Search (MCMS), a Monte-Carlo search algorithm for finite, turned based, stochastic, two-player, zero-sum games of perfect information. Through a combination of sparse sampling and classical pruning techniques, MCMS allows deep plans to be constructed. Unlike other popular tree search techniques, MCMS is suitable for densely stochastic games, i.e., gam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33018973